Generic Algorithms for Consistency Checking of Mutual-Exclusion and Binding Constraints in a Business Process Context
نویسندگان
چکیده
In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need for such generic algorithms in our real-world projects. Thus, the algorithms are a result of the experiences we gained in analyzing, designing, and implementing a number of corresponding software systems and tools. In particular, these algorithms check corresponding consistency requirements to prevent constraint conflicts and to ensure the design-time and runtime compliance of a process-related role-based access control (RBAC) model.
منابع مشابه
Detecting and Resolving Conflicts of Mutual-Exclusion and Binding Constraints in a Business Process Context
Mutual exclusion and binding constraints are important means to define which combinations of subjects and roles can be assigned to the tasks that are included in a business process. Due to the combinatorial complexity of potential role-to-subject and task-to-role assignments, there is a strong need to systematically check the consistency of a given set of constraints. In this paper, we discuss ...
متن کاملConsistency Checks for Duties in Extended UML2 Activity Models
Process-aware information systems support the execution of business processes. In this context, organizations require the precise specification of security policies that govern the behavior of subjects in the systems. Obligation policies specify duties to be fulfilled by certain subjects. In organizational contexts, duties are often associated with a certain task in a business process. In this ...
متن کاملVerification of a Hierarchical Generic Mutual Exclusion Algorithm
In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verificati...
متن کاملChecking Satisfiability Aspects of Binding Constraints in a Business Process Context
Binding of Duty (BOD) constraints define that the same subject (or role) who performed a certain task t1 must also perform a corresponding bound task t2. In this paper, we describe algorithms for checking the satisfiability of binding constraints in a business process context. In particular, these algorithms check the configuration of a process-related RBAC model to find satisfiability conflict...
متن کاملEnforcement of entailment constraints in distributed service-based business processes☆
CONTEXT A distributed business process is executed in a distributed computing environment. The service-oriented architecture (SOA) paradigm is a popular option for the integration of software services and execution of distributed business processes. Entailment constraints, such as mutual exclusion and binding constraints, are important means to control process execution. Mutually exclusive task...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010